Numerical Accuracy Evaluation for Polynomial Computation
نویسندگان
چکیده
Fixed-point conversion requires fast analytical methods to evaluate the accuracy degradation due to quantization noises. Usually, analytical methods do not consider the correlation between quantization noises. Correlation between quantization noises occurs when a data is quantized several times. This report explained, through an example, the methodology used in the ID.Fix tool to support correlation. To decrease the complexity, a method to group together several quantization noises inside a same noise source is described. The maximal relative estimation error obtained with the proposed approach is less than 2%. Key-words: fixed-point, quantization, analytic approach, noise, correlation This is a note This is a second note ∗ University of Rennes, INRIA, ENSSAT 6 rue Kerampont, 22300 Lannion. e-mail: [email protected] † Shared foot note ‡ IRISA/INRIA, ENSSAT 6 rue Kerampont, 22300 Lannion. e-mail: [email protected] ha l-0 06 72 65 4, v er si on 1 21 F eb 2 01 2 Évaluation de la précision numérique pour calcul polynomial Résumé : La conversion en virgule fixe nécessite des méthodes analytiques rapides pour évaluer la dégradation de la précision liée aux bruits de quantification. Actuellement, les méthodes analytiques ne considèrent pas la corrélation entre les bruits de quantification. Cette corrélation est due à la quantification d’une même donnée plusieurs fois. Ce rapport explique, au travers d’un exemple, la méthodologie utilisée dans l’outils ID.Fix pour prendre en compte la corrélation. Pour diminuer la complexité, une méthode de regroupement des bruits de quantification dans une source de bruit est décrite. La valeur maximale de l’erreur d’estimation relative obtenue avec l’approche proposée est inférieuree à 2%. Mots-clés : virgule fixe, quantification, approche analytique, correlation ha l-0 06 72 65 4, v er si on 1 21 F eb 2 01 2 Numerical Accuracy Evaluation for Polynomial Computation 3
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملNumerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.
The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...
متن کاملCORDIC Processor for Variable-Precision Interval Arithmetic
In this paper we present a specific CORDIC processor for variable-precision coordinates. This system allows us to specify the precision to perform the CORDIC operation, and control the accuracy of the result, in such a way that re-computation of inaccurate results can be carried out with higher precision. It permits a reliable and accurate evaluation of a wide range of elementary functions. The...
متن کاملStability of Parallel Algorithms for Polynomial Evaluation
In this paper, we analyse the stability of parallel algorithms for the evaluation of polynomials written es a finite series of orthogonal polynomials. The basic part of the computation is the solution of a triangular tridiagonal linear system. This fact allows us to present a more detailed analysis. The theoretical results show that the parallel algorithms are almost as stable as their sequenti...
متن کاملConstruction of bootstrap confidence intervals on sensitivity indices computed by polynomial chaos expansion
Sensitivity analysis aims at quantifying influence of input parameters dispersion on the output dispersion of a numerical model. When the model evaluation is time consuming, the computation of Sobol' indices based on Monte Carlo method is not applicable and a surrogate model has to be used. Among all approximation methods, polynomial chaos expansion is one of the most efficient to calculate var...
متن کاملNUMERICAL SOLUTION OF ONE-DIMENSIONAL HEAT AND WAVE EQUATION BY NON-POLYNOMIAL QUINTIC SPLINE
This paper present a novel numerical algorithm for the linear one-dimensional heat and wave equation. In this method, a nite dierenceapproach had been used to discrete the time derivative while cubic spline isapplied as an interpolation function in the space dimension. We discuss theaccuracy of the method by expanding the equation based on Taylor series andminimize the error. The proposed metho...
متن کامل